package bite;

/**
 * Creared with IntelliJ IDEA.
 * Description:正整数A和正整数B 的最小公倍数是指 能被A和B整除的最小的正整数值，设计一个算法，求输入A和B的最小公倍数。
 * User:yxd
 * Date:2022-04-01
 * Time:15:14
 */
import java.util.Scanner;
public class Day8_2 {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int a = input.nextInt();
        int b = input.nextInt();
        System.out.println(x(a,b));
    }
    public static int y(int a, int b){
        return b == 0 ? a :y( b,a % b);//辗转
    }
    public static int gbc(int a,int b){
        if(a == b){
            return a;
        }
        if(a < b){
            int tmp = a;
            a = b;
            b = tmp;
        }
        int r = 0;
        while((r = a % b) > 0){
            a = b;
            b = r;
        }
        return b;
    }
    public static int x(int a,int b){
        return (a * b) / y(a,b) ;//求出最小公因子,然后除掉就好了
    }
}